Subdivision Algorithms and Convexity Analysis for Rational Bézier Triangular Patches
نویسندگان
چکیده
Triangular surfaces are important because in areas where the geometry is not similar to rectangular domain, the rectangular surface patch will collapse into a triangular patch. In such a case, one boundary edge may collapse into a boundary vertex of the patch, giving rise to geometric dissimilarities (e.g. shape parameters, Gaussian curvature distribution, cross boundary continuities etc.) and topological inconsistency. Furthermore, since a triangular patch (i.e. defined as a closed polygon) is a basic figure in algebraic topology; hence any fairly irregular complex geometry can be efficiently modeled/designed/ regenerated with rational triangular patches. But, still triangular surfaces over triangular domain remain relatively unexplored as compared to rectangular surfaces over rectangular domain. In the present paper, we present subdivision algorithms for rational Bézier triangular patches for arbitrary subdivision. The algorithms are generated by constructing degenerate Bézier triangles and tetrahedron and using their edges to subdivide the original curve. Using the ‘classical probability theory’, we derive the algorithms by constructing higher dimensional degenerate Bézier simplices and incorporate their triangular sub-simplices. Additionally, we analyze the algorithms for convexity and derive conditions that preserve convexity. AMS MSC 2000: 65D07, 65D10, 65D17, and 68U07. ACM CCS: G.1.1, G.1.2, and I.3.5.
منابع مشابه
Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces
An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is con...
متن کاملOn convex Bézier triangles
— Goodman [8] showed that uniform subdivision of triangular Bézier nets preserves convexity. Hère, a very short proofofthis f act is given which applies even to box spline surfaces and degree élévation instead of subdivision. Secondiy, it is shown that every Bézier net of a quadratic convex Bézier triangle can be subdivided such that the net becomes convex.
متن کاملBézier patches on almost toric surfaces
The paper is devoted to the parametrization extension problem: given a loop composed of 3 (resp. 4) rational Bézier curves on a rational surface X, find a triangular (resp. tensor product) Bézier patch on X of optimal degree bounded by these curves. The constructive solution to the formulated problem is presented in details for cases where X is a sphere or a hyperbolic paraboloid. Then X is an ...
متن کاملTriangular Bézier Clipping
This short paper introduces a new approach to finding ray– patch intersections with triangular Bernstein–Bézier patches of arbitrary degree. Unlike a previous approach based on a combination of hierarchical subdivision and a Newton–like iteration scheme [7], this work extends the concept of Bézier clipping to the triangular domain. The problem of reporting wrong intersections, inherent to the o...
متن کاملOptimal multi-degree reduction of triangular Bézier surfaces with corners continuity in the norm L2
This paper derives an approximation algorithm for multi-degree reduction of a degree n triangular Bézier surface with corners continuity in the normL2. The new idea is to use orthonormality of triangular Jacobi polynomials and the transformation relationship between bivariate Jacobi and Bernstein polynomials. This algorithm has a very simple and explicit expression in matrix form, i.e., the red...
متن کامل